Quasi-Destructive Graph Unification
نویسنده
چکیده
Graph unification is the most expensive part of unification-based grammar parsing. It often takes over 90% of the total parsing time of a sentence. We focus on two speed-up elements in the design of unification algorithms: 1) elimination of excessive copying by only copying successful unifications, 2) Finding unification failures as soon as possible. We have developed a scheme to attain these two elements without expensive overhead through temporarily modifying graphs during unification to eliminate copying during unification. We found that parsing relatively long sentences (requiring about 500 top-level unifications during a parse) using our algorithm is approximately twice as fast as parsing the same sentences using Wroblewski's algorithm.
منابع مشابه
Memory-Efficient and Thread-Safe Quasi-Destructive Graph Unification
In terms of both speed and memory consumption, graph unification remains the most expensive component of unification-based grammar parsing. We present a technique to reduce the memory usage of unification algorithms considerably, without increasing execution times. Also, the proposed algorithm is thread-safe, providing an efficient algorithm for parallel processing as well.
متن کاملSignature-check Based Unification Filter
Among the different processes that entail unification-based grammar parsing, the unification of feature structures is by far the most expensive one in terms of execution time. Unification of the feature structures of a given sentence typically takes between 85 and 98 per cent of the total elapsed time during parsing, thus the need to develop faster unification methods. The approach presented in...
متن کاملRational Unification in 28 Characters
We present a case study where Synchronising Graphs, a system of parallel graph transformation, are used to solve the syntactic unification problem for first order rational terms (with possibly infinite unifier). The solution we offer is efficient, that is quasi-linear, and simple: a program of 28 characters.
متن کاملA Decidable Case of the Semi-Unification Problem
Semi-unification is a common generalization of unification and matching. The semiunification problem is to decide solvability of finite sets of equations s = t and inequations s̃ ≤i t̃ between first-order terms, with different inequality relations ≤i, i ∈ I. A solution consists of a substitution T0 and residual substitutions Ti, i ∈ I, such that , respectively, T0(s) = T0(t) and Ti(T0(s̃)) = T0(t̃)...
متن کاملRevisions during Generation Using Non-destructive Unification
A realistic model for natural language generation must account for overt revisions of the syntactic structure (self-corrections) as well as covert revisions (backtracking on syntactic options). This paper presents the preliminaries of a hybrid architecture for grammatical encoding (the ‘tactical’ phase in sentence generation) which allows such revisions. This architecture combines the concept o...
متن کامل